Parallel Hermite Interpolation on Extended Fibonacci Cubes
نویسندگان
چکیده
This work suggests a parallel algorithm for Hermite interpolation on Extended Fibonacci Cube (n) EFC1 . The proposed algorithm has 3 phases: initialization, main and final. The main phase of the algorithm involves 3 2 N multiplications, N additions, N 2 subtractions and N divisions. In final phase we propose an efficient algorithm to accumulate the partial sums of Hermite interpolation in 2 ) (log2 n N O steps as oppose to the earlier algorithm in the literature that involves 2 n steps, where N is the number of nodes, n the degree of (n) EFC1 .
منابع مشابه
Parallel Lagrange Interpolation on Extended Fibonacci Cubes
In this paper is presented a parallel algorithm for computing a Lagrange interpolation on a Extended Fibonacci Cube EFC 1(n).The algorithm consists of three phases: initialisation phase, main phase in wich the Lagrange polynomials are computed and final phase in wich the terms of the interpolation formula are added together.
متن کاملParallel Hermite Interpolation on Faulty K-ary n-cubes Network
In this paper a parallel algorithm is developed for Hermite Interpolation k-ary n-cube network. The algorithm involves three phases: initial phase; main phase and final phase. The computational statistics for the parallel algorithm are also discussed. For N = k points Hermite Interpolation the parallel algorithm in worst case involves N/2 data communications, 2N+6 multiplications , 2N+3 subtrac...
متن کاملOn Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes
The interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using combina...
متن کاملEmbeddings of Linear Arrays, Rings and 2-D Meshes on Extended Lucas Cube Networks
A Fibonacci string is a length n binary string containing no two consecutive 1s. Fibonacci cubes (FC), Extended Fibonacci cubes (ELC) and Lucas cubes (LC) are subgraphs of hypercube defined in terms of Fibonacci strings. All these cubes were introduced in the last ten years as models for interconnection networks and shown that their network topology posseses many interesting properties that are...
متن کاملExtended Fibonacci cubes
The Fibonacci Cube is an interconnection network that possesses many desirable properties that are important in network design and application. The Fibonacci Cube can efficiently emulate many hypercube algorithms and uses fewer links than the comparable hypercube, while its size does not increase as fast as the hypercube. However, most Fibonacci Cubes (more than 2/3 of all) are not Hamiltonian....
متن کامل